Ask
Login
TAGGED IN

Theory Of Computation

Follow this tag to get notifications whenever a new post is added

ALL TAGS
0
votes
1
answer
5.3k
views
1
answer
Explain with an example Chomsky Normal Form
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
1.6k
views
1
answer
Convert the following grammar to GNF
theory of computation updated 3.5 years ago by teamques10 ★ 65k
1
vote
1
answer
5.8k
views
1
answer
Consider the following grammar
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
8.8k
views
1
answer
Design a Turing Machine to find the value of log 2n, where n is a unary number.
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
2.0k
views
1
answer
Consider the following grammar G = (V, T, P, S), V = {S, X, Y}, T {a, b} and productions P are Convert this grammer in Chomsky Normal Form (CNF).
theory of computation updated 2.3 years ago by pedsangini276 • 4.8k
0
votes
1
answer
10k
views
1
answer
Distinguish between DFA and NFA
theory of computation updated 2.3 years ago by pedsangini276 • 4.8k
0
votes
1
answer
2.6k
views
1
answer
Define a NDFA with and example
theory of computation updated 2.3 years ago by pedsangini276 • 4.8k
0
votes
1
answer
7.9k
views
1
answer
Write regular expression for the following languages.
theory of computation updated 2.3 years ago by pedsangini276 • 4.8k
1
vote
1
answer
33k
views
1
answer
Differentiate between NFA and DFA.
theory of computation updated 2.3 years ago by pedsangini276 • 4.8k
0
votes
1
answer
6.7k
views
1
answer
Short Note on Rice theorem.
theory of computation updated 3.5 years ago by teamques10 ★ 65k
2
votes
1
answer
10k
views
1
answer
Compare recursive and recursively enumerable languages
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
3.5k
views
1
answer
Explain Intractable problems and their classification in detail
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
8.1k
views
1
answer
Write Short Notes on
theory of computation updated 7.8 years ago by teamques10 ★ 65k
0
votes
1
answer
3.9k
views
1
answer
State and prove the halting problem
theory of computation updated 3.5 years ago by teamques10 ★ 65k
2
votes
1
answer
4.3k
views
1
answer
Variarst of Turning Machine
theory of computation updated 3.5 years ago by teamques10 ★ 65k
1
vote
1
answer
20k
views
1
answer
Construct Turing machine that accepts the string over E={0,1} and converts every occurrence of 111 to 101.
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
2.3k
views
1
answer
Construct PDA accepting the language. L = {anbn|n>0}.
theory of computation updated 3.5 years ago by teamques10 ★ 65k
1
vote
1
answer
5.1k
views
1
answer
State and Explain closure properties of Context Free Language.
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
1.2k
views
1
answer
Design DPDA to accept language
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
4.2k
views
1
answer
Construct a PDA accepting the following language :
theory of computation updated 3.5 years ago by teamques10 ★ 65k
2
votes
1
answer
25k
views
1
answer
Design a PDA to check for well-formed parentheses
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
5.7k
views
1
answer
Design a PDA that accepts all the strings containing equal number of a and b
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
1.5k
views
1
answer
Design DPDA to accept language means number of of a and b.
theory of computation updated 7.8 years ago by teamques10 ★ 65k
0
votes
1
answer
7.9k
views
1
answer
Design a Turing Machine which accepts all strings of the form 0n1n, n>=1
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
5.5k
views
1
answer
Design a Turing Machine which accepts all strings of the form anbn, n>=1
theory of computation updated 3.5 years ago by teamques10 ★ 65k
<prev • 104 results • page 2 of 5 • next >